More on Lazy Lists
نویسندگان
چکیده
This theory contains some useful extensions to the LList theory by Larry Paulson, including finite, infinite, and positive llists over an alphabet, as well as the new constants take and drop and the prefix order of llists. Finally, the notions of safety and liveness in the sense of [1] are defined.
منابع مشابه
The Topology of Lazy Lists
This directory contains two theories. The first, Topology, develops the basic notions of general topology. The second, LList Topology, develops the topology of lazy lists.
متن کاملAmortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking
Amortization has been underutilized in the design of persistent data structures, largely because traditional accounting schemes break down in a persistent setting. Such schemes depend on saving “credits” for future use, but a persistent data structure may have multiple “futures”, each competing for the same credits. We describe how lazy evaluation can often remedy this problem, yielding persist...
متن کاملA Typed Lambda Calculus with Categorical Type Constructors
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categorical objects like products and coproducts as well as recursive types like natural numbers and lists. It also allows duals of recursive types, i.e. lazy types, like infinite lists. It has generalized iterators for recursi...
متن کاملRecursive Functions on Lazy Lists via Domains and Topologies pdfauthor=Andreas Lochbihler and Johannes Hölzl
The usual definition facilities in theorem provers cannot handle all recursive functions on lazy lists; the filter function is a prime counterexample. We present two new ways of directly defining functions like filter by exploiting their dual nature as producers and consumers. Borrowing from domain theory and topology, we define them as a least fixpoint (producer view) and as a continuous exten...
متن کاملRecursive Functions on Lazy Lists via Domains and Topologies pdfauthor
The usual definition facilities in theorem provers cannot handle all recursive functions on lazy lists; the filter function is a prime counterexample. We present two new ways of directly defining functions like filter by exploiting their dual nature as producers and consumers. Borrowing from domain theory and topology, we define them as a least fixpoint (producer view) and as a continuous exten...
متن کامل